Measurement Matrix Design for Compressed Detection With Secrecy Guarantees
نویسندگان
چکیده
منابع مشابه
Cache-Aided Combination Networks with Secrecy Guarantees
In this paper, we study a cache-aided combination network, where a layer of relay nodes connects a server to a set of end users, under three different secrecy requirements. Both the relays and the end users are equipped with caches. First, we consider secure delivery where we require that an external entity must not gain any information about the database files by observing the transmitted sign...
متن کاملThe Chaotic Measurement Matrix for Compressed Sensing
How to construct a measurement matrix with good performance and easy hardware implementation is the core research problem in compressed sensing. In this paper, we present a simple and efficient measurement matrix named Incoherence Rotated Chaotic (IRC) matrix. We take advantage of the well pseudorandom of chaotic sequence, introduce the concept of the incoherence factor and rotation, and adopt ...
متن کاملCompressed Sensing with Approximate Message Passing: Measurement Matrix and Algorithm Design
Compressed sensing (CS) is an emerging technique that exploits the properties of a sparse or compressible signal to efficiently and faithfully capture it with a sampling rate far below the Nyquist rate. The primary goal of compressed sensing is to achieve the best signal recovery with the least number of samples. To this end, two research directions have been receiving increasing attention: cus...
متن کاملComputable performance guarantees for compressed sensing matrices
The null space condition for ℓ1 minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via ℓ1 minimization. However, verifying the null space condition is known to be computationally challenging. Most of the existing methods can provide only upper and lower bounds on the p...
متن کاملDeterministic Designs with Deterministic Guarantees: Toeplitz Compressed Sensing Matrices, Sequence Design and System Identification
In this paper we present a new family of discrete sequences having “random like” uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers. Exploiting results from the theory of continued fractions and diophantine approximations, we show that the class of sequences so formed has the property that the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Wireless Communications Letters
سال: 2016
ISSN: 2162-2337,2162-2345
DOI: 10.1109/lwc.2016.2574853